The Garden Hose Complexity for the Equality Function
نویسندگان
چکیده
The garden hose complexity is a new communication complexity introduced by H. Buhrman, S. Fehr, C. Schaffner and F. Speelman [BFSS13] to analyze position-based cryptography protocols in 1 ar X iv :1 31 2. 72 22 v2 [ qu an tph ] 3 0 D ec 2 01 3 the quantum setting. We focus on the garden hose complexity of the equality function, and improve on the bounds of O. Margalit and A. Matsliah[MM12] with the help of a new approach and of our handmade simulated annealing based solver. We have also found beautiful symmetries of the solutions that have lead us to develop the notion of garden hose permutation groups. Then, exploiting this new concept, we get even further, although several interesting open problems remain.
منابع مشابه
New Bounds for the Garden-Hose Model
We show new results about the garden-hose model. Our main results include improved lower bounds based on non-deterministic communication complexity (leading to the previously unknown Θ(n) bounds for Inner Product mod 2 and Disjointness), as well as an O(n · log n) upper bound for the Distributed Majority function (previously conjectured to have quadratic complexity). We show an efficient simula...
متن کاملPosition-Based Quantum Cryptography and the Garden-Hose Game
We study position-based cryptography in the quantum setting. We examine a class of protocols that only require the communication of a single qubit and 2n bits of classical information. To this end, we define a new model of communication complexity, the garden-hose model, which enables us to prove upper bounds on the number of EPR pairs needed to attack such schemes. This model furthermore opens...
متن کاملSatellite Conceptual Design Multi-Objective Optimization Using Co Framework
This paper focuses upon the development of an efficient method for conceptual design optimization of a satellite. There are many option for a satellite subsystems that could be choice, as acceptable solution to implement of a space system mission. Every option should be assessment based on the different criteria such as cost, mass, reliability and technology contraint (complexity). In this rese...
متن کاملAnalysis of Persian Gardens using Kaplan’s landscape preference theory (Case study: Fin garden, Shazdeh Mahan garden, Eram Garden & El Goli garden)
A review of findings shows that Persian gardens have attracted a wide area of interests between psychologists and environment designers. The main reasons behind the attraction of Persian gardens are natural content and particular landscape configuration. To study these features, overall organization examination is employed according to psychological pattern. One of the impressive psychological ...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کامل